On Free Models for Horn Clauses over Predicate Fuzzy Logics
نویسندگان
چکیده
منابع مشابه
Transformation of Guarded Horn Clauses for Model Building
The guarded fragment of rst order logic has been de ned in [ABN96]. It is interesting due to the fact that it is decidable and several modal logics can be translated into it. Guarded clauses, de ned by de Nivelle in [Niv98], result from transformation of guarded formulas into clause form. In [Niv98], it is shown that the class of guarded clause sets is decidable by saturation under ordered reso...
متن کاملPredicate Pairing for Program Verification
It is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for constrained Horn clauses (or CHC solvers) based on predicate abstraction are sometimes unable to verify satisfiability because they look for models that are definable in a given cla...
متن کاملOn Reduced Semantics for Fuzzy Predicate Logics
Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative relation. On the one hand, the Leibniz congruence of a model identifies the elements that are indistinguishable...
متن کاملThe Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics
This paper presents complexity results about the satisfiability ofmodal Horn clauses for several modal propositional logics. Almost all these results are negative in the sense that restricting the input formula to modal Horn clauses does not decrease the inherent complexity of the satisfiability problem. We first show that, when restricted to modal Horn clauses, the satisfiability problem for a...
متن کاملOn Elementary Extensions in Fuzzy Predicate Logics
Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We give a characterization of elementary equivalence in fuzzy predicate logics using elementary extensions and introduce an strengthening of this notion, the so-called strong elementary equivalence. Using the method of diagrams developed in [5] and elementary extensions we present a counterexample t...
متن کامل